package leetcode_acm.array;

/**
 * 功能描述
 *
 * @author: 张庭杰
 * @date: 2023年03月17日 14:25
 */
public class Search {
    public int search(int[] nums, int target) {
        if(nums == null || nums.length == 0){
            return -1;
        }
        int left = 0;int right = nums.length-1;
        while(left <= right){
            int mid = (left+((right-left)>>1));
            if(nums[mid] == target){
                return mid;
            }else if(nums[mid] > target){
                left = mid+1;
            }else{
                right = mid-1;
            }
        }
        return -1;
    }
}
